Restarting Automata with Structured Output and Functional Generative Description

نویسندگان

  • Martin Plátek
  • Frantisek Mráz
  • Markéta Lopatková
چکیده

Restarting automata were introduced for modeling linguistically motivated analysis by reduction. In this paper we enhance these automata with a structured output in the form of a tree. Enhanced restarting automata can serve as a formal framework for the Functional Generative Description. In this framework, a natural language is described at four layers. Working simultaneously with all these layers, tectogrammatical dependency structures that represent the meaning of the sentence are derived.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

(In)Dependencies in Functional Generative Description by Restarting Automata

We provide a formal model of a stratificational dependency approach to natural language description. This formal model is motivated by an elementary method of analysis by reduction, which serves for describing correct sentence analysis. The model is based on enhanced restarting automata that assign a set of parallel dependency structures to every reduction of an input sentence. These structures...

متن کامل

Towards a Formal Model for Functional Generative Description: Analysis by Reduction and Restarting Automata

Functional Generative Description (FGD) is a dependency based descriptive system, which has been in development since the 1960s, see esp. Sgall et al. (1969). FGD was originally implemented as a generative procedure, but lately we have been interested in a declarative representation. e object of the present paper concerns the foundations of a reduction system which is more complex than a reduc...

متن کامل

Relations and Transductions Realized by Restarting Automata

In the present thesis we introduce several ways of extending restarting automata to devices for realizing binary (word) relations, which is mainly motivated by linguistics. In particular, we adapt the notion of input/output-relations and proper-relations to restarting automata and to parallel communicating systems of two restarting automata (PC-systems). Further, we introduce a new model, calle...

متن کامل

Formalization of Word-Order Shifts by Restarting Automata

The phenomenon of word order freedom plays an important role in syntactic analysis of many natural languages. This paper introduces a notion of a word order shift, an operation reflecting the degree of word order freedom of natural languages. The word order shift is an operation based upon word order changes preserving syntactic correctness, individual word forms, their morphological characteri...

متن کامل

Towards a formal model of natural language description based on restarting automata with parallel DR-structures

We provide a formal model of a stratificational dependency approach to natural language description. This formal model is motivated by an elementary method of analysis by reduction, which serves for describing correct sentence analysis. The model is based on enhanced restarting automata that assign a set of parallel dependency structures to every reduction of an input sentence. These structures...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010